Higher dimensional orthogonal designs and applications
نویسندگان
چکیده
منابع مشابه
Higher dimensional orthogonal designs and applications
When n2 elements are given, they can be arranged in the form of a square; similarly, when n8 elements (g ≥ 3 an integer) are given, they can be arranged in the form of a g-dimensional cube of side n (in short, a g-cube). The position of the elements can be indicated by g suffixes. Disciplines Physical Sciences and Mathematics Publication Details Hammer, J and Seberry, J, Higher dimensional orth...
متن کاملSigned group orthogonal designs and their applications
Craigen introduced and studied signed group Hadamard matrices extensively in [1, 2]. Livinskyi [13], following Craigen’s lead, studied and provided a better estimate for the asymptotic existence of signed group Hadamard matrices and consequently improved the asymptotic existence of Hadamard matrices. In this paper, we introduce and study signed group orthogonal designs. The main results include...
متن کاملORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS
Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...
متن کاملOptimal Three-Dimensional Optical Orthogonal Codes and Related Combinatorial Designs
Using channel polarization technique in optical code-division multiple access, we can spread optical pulses in the spatial domain, in addition to the time and frequency domains. The pattern of transmitting optical pulses in these three dimensions are specified by the codewords of a three-dimensional optical orthogonal codes (3-D OOC). In this work, combinatorial designs related to optimal 3-D O...
متن کاملLower-dimensional Relaxations of Higher-dimensional Orthogonal Packing
Consider the feasibility problem in higher-dimensional orthogonal packing. Given a set I of d-dimensional rectangles, we need to decide whether a feasible packing in a d-dimensional rectangular container is possible. No item rotation is allowed and item edges are parallel to the coordinate axes. Typically, solution methods employ some bounds to facilitate the decision. Various bounds are known,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1981
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.1981.1056426